Relating Database Updates to Nonmonotonic Reasoning
نویسندگان
چکیده
منابع مشابه
Production Inference, Nonmonotonicity and Abduction
We introduce a general formalism of production inference relations that posses both a standard monotonic semantics and a natural nonmonotonic semantics. The resulting nonmonotonic system is shown to provide a syntax-independent representation of abductive reasoning. Abduction is a reasoning from facts to their possible explanations that is widely used now in many areas of AI, including diagnosi...
متن کاملNonmonotonic Reasoning as SAT Search
In this paper we show that there is a direct correspondence between prioritized propositional nonmonotonic reasoning and SAT search. This correspondence leads to two results. First, we can reason eeciently using a SAT oracle. We explore several algorithms for nding models for prioritized propositional circumscriptive theories and show that there are some cases where some of the models can not b...
متن کاملFoundations and Challenges of Change and Evolution in Ontologies (Dagstuhl Seminar 12441)
This report documents the program and the outcomes of Dagstuhl Seminar 12441 “Foundations and Challenges of Change and Evolution in Ontologies”, held from 28 October to 2 November 2012. The aim of the workshop was to bring together researchers working in the areas of logic-based ontologies, belief change, and database systems, along with researchers working in relevant areas in nonmonotonic rea...
متن کاملToward Updates in Description Logics
The use of DL systems to add reasoning capabilities to database is now a major trend in convergence between knowledge base and database system but is still confronted with the issue of data update. DL systems provide fact additions and retractions but no real object update mechanisms. We present a semantics for update that favours attribute values to concept membership and deals with incomplete...
متن کاملThe Complexity of Closed World Reasoning and Circumscription
Closed world reasoning is a common nonmonotonic technique that allows for dealing with negative information in knowledge and data bases. We present a detailed analysis of the computational complexity of the different forms of closed world reasoning for various fragments of propositional logic. The analysis allows us to draw a complete picture of the tractability/intractability frontier for such...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994